Clique problem - PDFSEARCH.IO - Document Search Engine

Clique problem
Results: 134

#	Item
51	A Local-Search 2-Approximation for 2-Correlation-Clustering Tom Coleman, James Saunderson, and Anthony Wirth The University of Melbourne Abstract. CorrelationClustering is now an established problem in Add to Reading List Source URL: www.mit.edu Language: English - Date: 2012-07-29 14:44:15 NP-complete problems Matroid theory Spanning tree Signed graph Graph Clique Tree Combinatorial optimization Eulerian path Graph theory Theoretical computer science Mathematics
52	Blow-Ups, Win/Win’s, and Crown Rules: Some New Directions in FPT Michael R. Fellows School of Electrical Engineering and Computer Science University of Newcastle, University Drive, Callaghan NSW 2308, Australia mfellow Add to Reading List Source URL: www.mrfellows.net Language: English - Date: 2009-10-05 20:16:31 NP-complete problems Parameterized complexity Kernelization Dominating set Vertex cover Path decomposition Planar separator theorem Clique problem Graph coloring Theoretical computer science Graph theory Mathematics
53	Improved Parameterized Algorithms for Network Query Problems Ron Y. Pinter, Hadas Shachnai, and Meirav Zehavi Department of Computer Science, Technion, Haifa 32000, Israel {pinter,hadas,meizeh}@cs.technion.ac.il Abstract Add to Reading List Source URL: www.cs.technion.ac.il Language: English - Date: 2014-03-05 14:37:49 Complexity classes NP-complete problems Parameterized complexity Tree decomposition Dynamic programming NP-hard NP Clique problem Theoretical computer science Computational complexity theory Graph theory
54	Thesis for the degree ‫עבודת גמר (תזה) לתואר‬ Master of Science Add to Reading List Source URL: www.wisdom.weizmann.ac.il Language: English - Date: 2015-01-22 08:25:27 NP-complete problems Graph coloring Graph operations Clique problem Clique Randomized algorithm Path decomposition Graph theory Theoretical computer science Mathematics
55	Graph-theoretic methods in combinatorial (algebraic) topology Michal Adamaszek Universit¨ at Bremen Add to Reading List Source URL: projects.au.dk Language: English - Date: 2013-04-29 03:32:40 Triangulation Clique NP-complete problems Graph coloring Simplicial complex Chordal graph Clique problem Hadwiger conjecture Graph theory Mathematics Algebraic topology
56 $CS109B Notes for LectureNP-Complete Problems We have met some problems that have \easy$	CS109B Notes for LectureNP-Complete Problems We have met some problems that have \easy" solutions; they have algorithms that run in time that is polynomial in the size of the graph, the parameter m. Examples: Add to Reading List Source URL: infolab.stanford.edu Language: English - Date: 2008-09-19 00:58:50 NP-complete problems Graph coloring Independent set NP-complete Clique Vertex cover NP Clique cover problem Domatic number Theoretical computer science Graph theory Computational complexity theory
57	Pregel: A System for Large-Scale Graph Processing Grzegorz Malewicz, Matthew H. Austern, Aart J. C. Bik, James C. Dehnert, Ilan Horn, Naty Leiser, and Grzegorz Czajkowski Google, Inc. {malewicz,austern,ajcbik,dehnert,il Add to Reading List Source URL: kowshik.github.io Language: English - Date: 2011-10-18 16:44:37 Graph coloring Vertex Graph Bellman–Ford algorithm Connected component Shortest path problem Tree Clique Matching Graph theory Graph connectivity Path
58	A Local-Search 2-Approximation for 2-Correlation-Clustering? Tom Coleman, James Saunderson, and Anthony Wirth The University of Melbourne Abstract. CorrelationClustering is now an established problem in Add to Reading List Source URL: tom.thesnail.org Language: English - Date: 2015-05-04 03:09:24 NP-complete problems Matroid theory Spanning tree Signed graph Clique Graph Tree Eulerian path Pseudoforest Graph theory Theoretical computer science Mathematics
59	Efficient Algorithms for Eulerian Extension and Rural Postman∗ Frederic Dorn† Hannes Moser‡¶ Mathias Weller§k Add to Reading List Source URL: fpt.akt.tu-berlin.de Language: English - Date: 2013-01-23 08:47:12 Route inspection problem Multigraph Graph Line graph Degree Directed graph Clique Shortest path problem BEST theorem Graph theory NP-complete problems Eulerian path
60	The Parameterized Complexity of the Rainbow Subgraph Problem Falk Hüffner? , Christian Komusiewicz?? , Rolf Niedermeier, and Martin Rötzschke Institut für Softwaretechnik und Theoretische Informatik, TU Berlin, German Add to Reading List Source URL: fpt.akt.tu-berlin.de Language: English - Date: 2014-07-31 12:35:33 NP-complete problems Graph coloring Degeneracy Vertex cover Edge coloring Clique Vertex Graph Dense subgraph Graph theory Theoretical computer science Mathematics